Categoricity may fail late

نویسندگان

  • Saharon Shelah
  • Andrés Villaveces
چکیده

We build an example that generalizes [HS90] to uncountable cases. In particular, our example yields a sentence ψ ∈ L(2λ)+,ω that is categorical in λ, λ, . . . , λ but not in ik+1(λ) . This is connected with the Loś Conjecture and with Shelah’s own conjecture and construction of excellent classes for the ψ ∈ Lω1,ω case. 1 The Loś Conjecture, without excellence Early results on the Categoricity Spectrum launched the development of Stability Theory and Classification Theory for first order logic. In the natural quest for generalizing the powerful results of those theories to Nonelementary Classes, some questions on Categoricity – specifically, the status of the Loś Conjecture (=Morley Theorem in First Order) – became a crucial test question. Among the specific issues studied, the following is central. Question 1.1 Old folklore question: what is the status of the Loś Conjecture (= Morley Theorem in the first order case) for ψ ∈ Lω1,ω? ∗ The first author’s research was partially supported by ‘BSF’ (USA-Israel); Publication no 648 in the first author’s publication list. The second author was sponsored by Colciencias and Semilleros de Investigación, Universidad Nacional de Colombia.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computable Categoricity versus Relative Computable Categoricity

We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...

متن کامل

On Computable Categoricity

We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. In particular, we show that every 1-decidable computably categorical structure is relatively ∆2-categorical, but that there is a computably categorical structure that is not even relatively arithmetically categorical. We also...

متن کامل

Categoricity Spectra for Rigid Structures

For a computable structure M , the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M . If the spectrum has a least degree, this degree is called the degree of categoricity of M . In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures wi...

متن کامل

Categoricity Properties for Computable Algebraic Fields

We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is ...

متن کامل

Degrees of Categoricity and the Hyperarithmetic Hierarchy

We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of Fokina, Kalimullin, and R. Miller to show that for every computable ordinal α, 0 is the degree of categoricity of some computable structure A. We show additionally that for α a computable successor ordinal, every degree 2-c.e. in and above 0 is a degree of categoricity. We further prove that every degree of c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011